Performance and analysis of NTRU and Advanced NTRU cryptosystems
نویسندگان
چکیده
Authentication and Confidentiality is the main goal of the public key cryptosystems deal when communication takes place between both the parties. The mostly used cryptographic methods are broadly classified as symmetric and asymmetric. The DES comes under the category of symmetric key cryptosystem whereas RSA, NTRU[1] belongs to the category of asymmetric key cryptosystem. NTRU (Nth degree truncated polynomial ring units) is again extended to Advanced NTRU.This paper describes and represents a comparative study on both the cryptosystems by using variable sized text files as input and the results were analyzed in an effective way. This has given an overall idea about the performance of the cryptosystem. Keywords— Encryption, Decryption, Polynomial, NTRU
منابع مشابه
QTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملNTRU Prime
Several ideal-lattice-based cryptosystems have been broken by recent attacks that exploit special structures of the rings used in those cryptosystems. The same structures are also used in the leading proposals for post-quantum lattice-based cryptography, including the classic NTRU cryptosystem and typical Ring-LWE-based cryptosystems. This paper proposes NTRU Prime, which tweaks NTRU to use rin...
متن کاملTowards Faster Cryptosystems, II
We discuss three cryptosystems, NTRU , SPIFI , and ENROOT , that are based on the use of polynomials with restricted coefficients.
متن کاملNTRU Prime: Reducing Attack Surface at Low Cost
Several ideal-lattice-based cryptosystems have been broken by recent attacks that exploit special structures of the rings used in those cryptosystems. The same structures are also used in the leading proposals for post-quantum lattice-based cryptography, including the classic NTRU cryptosystem and typical Ring-LWE-based cryptosystems. This paper (1) proposes NTRU Prime, which tweaks NTRU to use...
متن کاملAlgebraic attack on lattice based cryptosystems via solving equations over real numbers
In this paper we present a new algorithm to attack lattice based cryptosystems by solving a problem over real numbers. In the case of the NTRU cryptosystem, if we assume the additional information on the modular operations, we can break the NTRU cryptosystems completely by getting the secret key. We believe that this fact was not known before.
متن کامل